Learning Domain Knowledge to Improve Theorem Proving
نویسندگان
چکیده
We present two learning inference control heuristics for equa-tional deduction. Based on data about facts that contributed to previous proofs, evaluation functions learn to select equations that are likely to be of use in new situations. The rst evaluation function works by symbolic retrieval of generalized patterns from a knowledge base, the second function compiles the knowledge into abstract term evaluation trees. We analyze the performance of the two heuristics on a set of examples and demonstrate their usefulness. We also show that these strategies are well suited for cooperation in the framework of the knowledge based distribution method teamwork.
منابع مشابه
A Connectionist Control Component for the Theorem Prover SETHEO
Today, the power of automated theorem provers is yet too weak for proving many challinging problems. However heuristics for guiding the proof search can dramatically improve the power of such provers. Since it is very diicult to develop heuristics by hand and since they have to be developed speciically for each problem domain (theory), we decided to derive heuristics automatically using machine...
متن کاملCombining Theorem Proving with Natural Language Processing
The LogAnswer system is an application of automated reasoning to the field of open domain question answering, which aims at finding answers to natural language questions regarding arbitrary topics. In our system we have integrated an automated theorem prover in a framework of natural language processing tools to allow for deductive reasoning over an extensive knowledge base derived from textual...
متن کاملRecognizing Implicit Discourse Relations through Abductive Reasoning with Large-scale Lexical Knowledge
Discourse relation recognition is the task of identifying the semantic relationships between textual units. Conventional approaches to discourse relation recognition exploit surface information and syntactic information as machine learning features. However, the performance of these models is severely limited for implicit discourse relation recognition. In this paper, we propose an abductive th...
متن کاملArtificial Neural Networks that Learn to Satisfy Logic Constraints
Logic-based problems such as planning, theorem proving, or puzzles like Soduko, typically involve combinatorial search and structured knowledge representation. Artificial neural networks (ANNs) are very successful statistical learners; however, for many years, they have been criticized for their weaknesses in representing and in processing complex structured knowledge which is crucial for combi...
متن کاملAn application of automated reasoning in natural language question answering
The LogAnswer system is an application of automated reasoning to the field of open domain question answering. In order to find answers to natural language questions regarding arbitrary topics, the system integrates an automated theorem prover in a framework of natural language processing tools. The latter serve to construct an extensive knowledge base automatically from given textual sources, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996